Rectilinear block placement using B*-trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Module Placement with Boundary Constraints Using B*-trees

The module placement problem is to determine the coordinates of logic modules in a chip such that no two modules overlap and some cost (e.g., silicon area, interconnection length, etc) is optimized. To shorten connections between inputs and outputs and/or make related modules adjacent, it is desired to place some modules along the specific boundaries of a chip. To deal with such boundary constr...

متن کامل

4-PLACEMENT OF ROOTED TREES

A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.

متن کامل

Two-level rectilinear Steiner trees

Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...

متن کامل

Rectilinear Trees under Rotation and Related Problems

We onsider the problem of nding a minimum spanning tree for a set of points in the plane where the orientations of edges are restri ted to uniformly distributed orientations, = 2; 3; 4; : : :, and where the oordinate system an be rotated around the origo by an arbitrary angle. The most important ase with appli ations in VLSI design arises when = 2; in this, soalled re tilinear ase, the edges ha...

متن کامل

Rectilinear Bsp Trees for Preferred Ray Sets

Rectilinear Binary Space Partitioning (BSP) trees are often used for solving various types of range searching problems including ray shooting. We propose a novel method for construction of rectilinear BSP trees for a preferred set of ray shooting queries. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. We analyse and discuss the properties of constru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Design Automation of Electronic Systems

سال: 2003

ISSN: 1084-4309,1557-7309

DOI: 10.1145/762488.762490